Non-Stupidity Condition and Pragmatics in Artificial Intelligence

Symbol Grounding Problem (SGP) (Harnad 1990) is commonly considered one of the central challenges in philosophy artificial intelligence as its resolution deemed necessary for bridging gap between simple data processing and understanding meaning language. SGP has been addressed on numerous occasions with varying results, all attempts having severely, but most part justifiably, restricted by Zero Semantic Commitment Condition (Taddeo Floridi 2005). A further condition that demands explanatory power terms machine-to-human communication Non-Stupidity (Bringsjord 2013) an SG approach to be able account plausibility higher-level language use understanding, such pragmatics. In this article, we undertake endeavour attempting explain how merging certain early requirements SG, embodiment, environmental interaction (Ziemke 1998), compliance Z-Condition symbol emergence (Sun 2000; Tangiuchi et al. 2016, etc.) rather than direct at grounding can help emulate human acquisition (Vogt 2004; Cowley 2007). Along presumption mind are both symbolic (Fodor 1980) computational (Chomsky 2017), argue some abstract aspects logically formalised finally, melange approaches yield satisfy without breaking any previous conditions.